XX^T matrices with independent entries
نویسندگان
چکیده
منابع مشابه
On the Singularity of Random Matrices with Independent Entries
We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/ √ n). The purpose of this note is to provide a short and elementary proof of this fact using a Bernoulli decomposition of arbitrary non degenerate random variables.
متن کاملCorrelations between eigenvalues of large random matrices with independent entries.
We derive the connected correlation functions for eigenvalues of large Her-mitian random matrices with independently distributed elements using both a diagrammatic and a renormalization group (RG) inspired approach. With the diagrammatic method we obtain a general form for the one, two and three-point connected Green function for this class of ensembles when matrix elements are identically dist...
متن کاملDelocalization of Eigenvectors of Random Matrices with Independent Entries
We prove that an n× n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n−1/2), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach...
متن کاملAlmost Hadamard Matrices with Complex Entries
We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be no such matrices, besides the usual Hadamard ones. We verify this conjecture in a number of situations, and notably for most of the known examples of real a...
متن کاملRanks of matrices with few distinct entries
An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics
سال: 2023
ISSN: ['1980-0436']
DOI: https://doi.org/10.30757/alea.v20-05